Experimental and Monte Carlo absolute characterization of a medical electron beam using a magnetic spectrometer

The knowledge of the absolute energy distributions of the particles emitted from a clinical accelerator is important for the evaluation of Monte Carlo simulations developed for treatment planning. In this paper, an original approach is presented which allows to measure the absolute energy distribution of the electron beam delivered by a Varian 21Ex medical accelerator. The electron beam was characterized at the isocenter with calibrated image plates covering the exit window of a magnetic spectrometer. The characteristics of the electron beam emitted from an effective source have been inferred from the measurements using the Geant4 Monte Carlo code. The contribution of direct electrons to the absolute depth-dose curve in a water phantom is estimated.     

A characterization of multivariate quasi-interpolation formulas and its applications

Summary Let be a compactly supported function on ^s andS () the linear space withgenerator ; that is,S () is the linear span of the multiinteger translates of . It is well known that corresponding to a generator there are infinitely many quasi-interpolation formulas. A characterization of these formulas is presented which allows for their direct calculation in a variety of forms suitable to particular applications, and in addition, provides a clear formulation of the difficult problem of minimally supported quasi-interpolants. We introduce a generalization of interpolation called -interpolation and a notion of higher order quasi-interpolation called -approximation. A characterization of -approximants similar to that of quasi-interpolants is obtained with similar applications. Among these applications are estimating least-squares approximants without matrix inversion, surface fitting to incomplete or semi-scattered discrete data, and constructing generators with one-point quasi-interpolation formulas. It will be seen that the exact values of the generator at the multi-integers ^s facilitates the above study. An algorithm to yield this information for box splines is discussed.Supported by the National Science Foundation and the U.S. Army Research Office     

Wave trains in a model of gypsy moth population dynamics

A recent model of gypsy moth [Lymantria dispar (Lepidoptera: Lymantriidae)] populations led to the observation of traveling waves in a one-dimensional spatial model. In this work, these waves are studied in more detail and their nature investigated. It was observed that when there are no spatial effects the model behaves chaotically under certain conditions. Under the same conditions, when diffusion is allowed, traveling waves develop. The biomass densities involved in the model, when examined at one point in the spatial domain, are found to correspond to a limit cycle lying on the surface of the chaotic attractor of the spatially homogeneous model. Also observed are wave trains that have modulating maxima, and which when examined at one point in the spatial domain show a quasiperiodic temporal behavior. This complex behavior is determined to be due to the interaction of the traveling wave and the chaotic background dynamics. (c) 1995 American Institute of Physics.     

Uniquely Edge-3-Colorable Graphs and Snarks

 A cubic graph G is uniquely edge-3-colorable if G has precisely one 1-factorization. It is proved in this paper, if a uniquely edge-3-colorable, cubic graph G is cyclically 4-edge-connected, but not cyclically 5-edge-connected, then G must contain a snark as a minor. This is an approach to a conjecture that every triangle free uniquely edge-3-colorable cubic graph must have the Petersen graph as a minor. Fiorini and Wilson (1976) conjectured that every uniquely edge-3-colorable planar cubic graph must have a triangle. It is proved in this paper that every counterexample to this conjecture is cyclically 5-edge-connected and that in a minimal counterexample to the conjecture, every cyclic 5-edge-cut is trivial (an edge-cut T of G is cyclic if no component of G\T is acyclic and a cyclic edge-cut T is trivial if one component of G\T is a circuit of length |T|). Received: July 14, 1997 Revised: June 11, 1998     

Nowhere zero flows in line graphs

Cai an Corneil (Discrete Math. 102 (1992) 103–106), proved that if a graph has a cycle double cover, then its line graph also has a cycle double cover, and that the validity of the cycle double cover conjecture on line graphs would imply the truth of the conjecture in general. In this note we investigate the conditions under which a graph G has a nowhere zero k-flow would imply that L(G), the line graph of G, also has a nowhere zero k-flow. The validity of Tutte's flow conjectures on line graphs would also imply the truth of these conjectures in general.     

Hamiltonian s-properties and eigenvalues of k-connected graphs

Chvátal and Erdös (1972) [5] proved that, for a k-connected graph G, if the stability number $\alpha (G)\le k?s$, then G is Hamilton-connected ($s=1$) or Hamiltonian ($s=0$) or traceable ($s=?1$). Motivated by the result, we focus on tight sufficient spectral conditions for k-connected graphs to possess Hamiltonian s-properties. We say that a graph possesses Hamiltonian s-properties, which means that the graph is Hamilton-connected if $s=1$, Hamiltonian if $s=0$, and traceable if $s=?1$.For a real number $a\ge 0$, and for a k-connected graph G with order n, degree diagonal matrix $D(G)$ and adjacency matrix $A(G)$, we have identified best possible upper bounds for the spectral radius ${\lambda }_1(aD(\mathrm{\Gamma })+A(\mathrm{\Gamma }))$, where Γ is either G or the complement of G, to warrant that G possesses Hamiltonian s-properties. Sufficient conditions for a graph G to possess Hamiltonian s-properties in terms of upper bounds for the Laplacian spectral radius as well as lower bounds of the algebraic connectivity of G are also obtained. Other best possible spectral conditions for Hamiltonian s-properties are also discussed.     

Generalised Riemann problem for Euler system

This article is a survey on the progress in the study of the generalized Riemann problems for MD Euler system. A new result on generalized Riemann problems for Euler systems containing all three main nonlinear waves (shock, rarefaction wave and contact discontinuity) is also introduced.     

Antimagic orientations of even regular graphs

A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to . A labeling of D is antimagic if no two vertices in D have the same vertex-sum, where the vertex-sum of a vertex for a labeling is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Motivated by the conjecture of Hartsfield and Ringel from 1990 on antimagic labelings of graphs, Hefetz, Mütze, and Schwartz [On antimagic directed graphs, J. Graph Theory 64 (2010) 219–232] initiated the study of antimagic labelings of digraphs, and conjectured that every connected graph admits an antimagic orientation, where an orientation D of a graph G is antimagic if D has an antimagic labeling. It remained unknown whether every disjoint union of cycles admits an antimagic orientation. In this article, we first answer this question in the positive by proving that every 2-regular graph has an antimagic orientation. We then show that for any integer , every connected, 2d-regular graph has an antimagic orientation. Our technique is new.     

On the existence of intermediate magnetohydrodynamic shock waves

We consider the questions related to the structure of shock waves for a system of magnetohydrodynamic equations. Using Conley's connection matrix, we recover and extend earlier results due to C. Conley and J. Smoller. In particular, we give a simpler proof of the existence of fast and slow shocks with structure. We also demonstrate that for some viscosity parameters intermediate shocks occur. Furthermore, under an assumption of transversality, we show that there exist multi-parameter families of these intermediate shocks.This research was done while both authors were visiting the Lefschetz Center for Dynamical Systems at Brown University.Supported in part by the NSF under Grant DMS-8507056.Supported in part by AFOSR 87-0347.